0.03/0.13	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.13/0.14	% Command    : run_E %s %d THM
0.14/0.35	% Computer : n011.cluster.edu
0.14/0.35	% Model    : x86_64 x86_64
0.14/0.35	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.14/0.35	% Memory   : 8042.1875MB
0.14/0.35	% OS       : Linux 3.10.0-693.el7.x86_64
0.14/0.35	% CPULimit   : 960
0.14/0.35	% WCLimit    : 120
0.14/0.35	% DateTime   : Tue Aug  9 04:34:06 EDT 2022
0.14/0.35	% CPUTime    : 
0.21/0.48	Running higher-order on 8 cores theorem proving
0.21/0.48	Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox/benchmark/theBenchmark.p
0.21/0.48	# Version: 3.0pre003-ho
0.21/0.49	# Preprocessing class: HSSSSMSSSSSNSSA.
0.21/0.49	# Scheduled 8 strats onto 8 cores with 120 seconds (960 total)
0.21/0.49	# Starting post_as_ho12 with 120s (1) cores
0.21/0.49	# Starting new_bool_9 with 120s (1) cores
0.21/0.49	# Starting post_as_ho1 with 120s (1) cores
0.21/0.49	# Starting post_as_ho4 with 120s (1) cores
0.21/0.49	# Starting post_as_ho2 with 120s (1) cores
0.21/0.49	# Starting ehoh_best2_full_lfho with 120s (1) cores
0.21/0.49	# Starting full_lambda_10 with 120s (1) cores
0.21/0.49	# Starting new_ho_8 with 120s (1) cores
0.21/0.49	# post_as_ho12 with pid 27856 completed with status 0
0.21/0.49	# Result found by post_as_ho12
0.21/0.49	# Preprocessing class: HSSSSMSSSSSNSSA.
0.21/0.49	# Scheduled 8 strats onto 8 cores with 120 seconds (960 total)
0.21/0.49	# Starting post_as_ho12 with 120s (1) cores
0.21/0.49	# No SInE strategy applied
0.21/0.49	# Search class: HGHSF-FFSF00-SSSFFSBN
0.21/0.49	# Scheduled 6 strats onto 1 cores with 120 seconds (120 total)
0.21/0.49	# Starting ho_unfolding_3 with 65s (1) cores
0.21/0.49	# ho_unfolding_3 with pid 27864 completed with status 0
0.21/0.49	# Result found by ho_unfolding_3
0.21/0.49	# Preprocessing class: HSSSSMSSSSSNSSA.
0.21/0.49	# Scheduled 8 strats onto 8 cores with 120 seconds (960 total)
0.21/0.49	# Starting post_as_ho12 with 120s (1) cores
0.21/0.49	# No SInE strategy applied
0.21/0.49	# Search class: HGHSF-FFSF00-SSSFFSBN
0.21/0.49	# Scheduled 6 strats onto 1 cores with 120 seconds (120 total)
0.21/0.49	# Starting ho_unfolding_3 with 65s (1) cores
0.21/0.49	# Preprocessing time       : 0.001 s
0.21/0.49	# Presaturation interreduction done
0.21/0.49	
0.21/0.49	# Proof found!
0.21/0.49	# SZS status Theorem
0.21/0.49	# SZS output start CNFRefutation
0.21/0.49	thf(decl_22, type, c: $i).
0.21/0.49	thf(decl_23, type, b: $i).
0.21/0.49	thf(decl_24, type, a: $i).
0.21/0.49	thf(decl_25, type, c_less_: $i > $i > $o).
0.21/0.49	thf(cBLEDSOE4_W_AX, conjecture, (![X1:$i, X2:$i]:(((c_less_ @ X1 @ X2)=>((X1)!=(X2))))=>(?[X3:$i > $o]:(((~((X3 @ a))&(X3 @ b))&~((X3 @ c))))<=((c_less_ @ b @ c)&(c_less_ @ a @ b)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', cBLEDSOE4_W_AX)).
0.21/0.49	thf(c_0_1, negated_conjecture, ~((![X1:$i, X2:$i]:(((c_less_ @ X1 @ X2)=>((X1)!=(X2))))=>(((c_less_ @ b @ c)&(c_less_ @ a @ b))=>?[X3:$i > $o]:(((~(X3 @ a)&(X3 @ b))&~(X3 @ c)))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cBLEDSOE4_W_AX])])).
0.21/0.49	thf(c_0_2, negated_conjecture, ![X7:$i, X8:$i, X9:$i > $o]:(((~(c_less_ @ X7 @ X8)|((X7)!=(X8)))&(((c_less_ @ b @ c)&(c_less_ @ a @ b))&((X9 @ a)|~(X9 @ b)|(X9 @ c))))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])).
0.21/0.49	thf(c_0_3, negated_conjecture, ![X3:$i > $o]:(((X3 @ a)|(X3 @ c)|~((X3 @ b)))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.21/0.49	thf(c_0_4, negated_conjecture, ![X1:$i, X2:$i]:((~((c_less_ @ X1 @ X2))|((X1)!=(X2)))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.21/0.49	thf(c_0_5, negated_conjecture, (c_less_ @ a @ b), inference(split_conjunct,[status(thm)],[c_0_2])).
0.21/0.49	thf(c_0_6, negated_conjecture, (((a)=(b))|((c)=(b))), inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]), c_0_3])).
0.21/0.49	thf(c_0_7, negated_conjecture, ![X1:$i]:(~((c_less_ @ X1 @ X1))), inference(er,[status(thm)],[c_0_4])).
0.21/0.49	thf(c_0_8, negated_conjecture, (c_less_ @ b @ c), inference(split_conjunct,[status(thm)],[c_0_2])).
0.21/0.49	thf(c_0_9, negated_conjecture, ((c)=(b)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_5, c_0_6]), c_0_7])).
0.21/0.49	thf(c_0_10, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_8, c_0_9]), c_0_7]), ['proof']).
0.21/0.49	# SZS output end CNFRefutation
0.21/0.49	# Parsed axioms                        : 5
0.21/0.49	# Removed by relevancy pruning/SinE    : 0
0.21/0.49	# Initial clauses                      : 8
0.21/0.49	# Removed in clause preprocessing      : 4
0.21/0.49	# Initial clauses in saturation        : 4
0.21/0.49	# Processed clauses                    : 14
0.21/0.49	# ...of these trivial                  : 0
0.21/0.49	# ...subsumed                          : 0
0.21/0.49	# ...remaining for further processing  : 14
0.21/0.49	# Other redundant clauses eliminated   : 1
0.21/0.49	# Clauses deleted for lack of memory   : 0
0.21/0.49	# Backward-subsumed                    : 0
0.21/0.49	# Backward-rewritten                   : 6
0.21/0.49	# Generated clauses                    : 8
0.21/0.49	# ...of the previous two non-redundant : 6
0.21/0.49	# ...aggressively subsumed             : 0
0.21/0.49	# Contextual simplify-reflections      : 0
0.21/0.49	# Paramodulations                      : 4
0.21/0.49	# Factorizations                       : 0
0.21/0.49	# NegExts                              : 0
0.21/0.49	# Equation resolutions                 : 1
0.21/0.49	# Propositional unsat checks           : 0
0.21/0.49	#    Propositional check models        : 0
0.21/0.49	#    Propositional check unsatisfiable : 0
0.21/0.49	#    Propositional clauses             : 0
0.21/0.49	#    Propositional clauses after purity: 0
0.21/0.49	#    Propositional unsat core size     : 0
0.21/0.49	#    Propositional preprocessing time  : 0.000
0.21/0.49	#    Propositional encoding time       : 0.000
0.21/0.49	#    Propositional solver time         : 0.000
0.21/0.49	#    Success case prop preproc time    : 0.000
0.21/0.49	#    Success case prop encoding time   : 0.000
0.21/0.49	#    Success case prop solver time     : 0.000
0.21/0.49	# Current number of processed clauses  : 3
0.21/0.49	#    Positive orientable unit clauses  : 2
0.21/0.49	#    Positive unorientable unit clauses: 0
0.21/0.49	#    Negative unit clauses             : 1
0.21/0.49	#    Non-unit-clauses                  : 0
0.21/0.49	# Current number of unprocessed clauses: 0
0.21/0.49	# ...number of literals in the above   : 0
0.21/0.49	# Current number of archived formulas  : 0
0.21/0.49	# Current number of archived clauses   : 10
0.21/0.49	# Clause-clause subsumption calls (NU) : 2
0.21/0.49	# Rec. Clause-clause subsumption calls : 2
0.21/0.49	# Non-unit clause-clause subsumptions  : 0
0.21/0.49	# Unit Clause-clause subsumption calls : 0
0.21/0.49	# Rewrite failures with RHS unbound    : 0
0.21/0.49	# BW rewrite match attempts            : 1
0.21/0.49	# BW rewrite match successes           : 1
0.21/0.49	# Condensation attempts                : 14
0.21/0.49	# Condensation successes               : 0
0.21/0.49	# Termbank termtop insertions          : 452
0.21/0.49	
0.21/0.49	# -------------------------------------------------
0.21/0.49	# User time                : 0.003 s
0.21/0.49	# System time              : 0.001 s
0.21/0.49	# Total time               : 0.004 s
0.21/0.49	# Maximum resident set size: 1604 pages
0.21/0.49	
0.21/0.49	# -------------------------------------------------
0.21/0.49	# User time                : 0.004 s
0.21/0.49	# System time              : 0.003 s
0.21/0.49	# Total time               : 0.008 s
0.21/0.49	# Maximum resident set size: 1708 pages
0.21/0.49	EOF